Alternating Krylov subspace image restoration methods
نویسندگان
چکیده
منابع مشابه
Alternating Krylov subspace image restoration methods
Alternating methods for image deblurring and denoising have recently received considerable attention. The simplest of these methods are two-way methods that restore contaminated images by alternating between deblurring and denoising. This paper describes Krylov subspace-based two-way alternating iterative methods that allow the application of regularization operators different from the identity...
متن کاملA Cascadic Alternating Krylov Subspace Image Restoration Method
This paper describes a cascadic image restoration method which at each level applies a two-way alternating denoising and deblurring procedure. Denoising is carried out with a wavelet transform, which also provides an estimate of the noise-level. The latter is used to determine a suitable regularization parameter for the Krylov subspace iterative deblurring method. The cascadic multilevel method...
متن کاملImage Deblurring with Krylov Subspace Methods
Image deblurring, i.e., reconstruction of a sharper image from a blurred and noisy one, involves the solution of a large and very ill-conditioned system of linear equations, and regularization is needed in order to compute a stable solution. Krylov subspace methods are often ideally suited for this task: their iterative nature is a natural way to handle such largescale problems, and the underly...
متن کاملMajorization-minimization generalized Krylov subspace methods for lp-lq optimization applied to image restoration
A new majorization-minimization framework for lp-lq image restoration is presented. The solution is sought in a generalized Krylov subspace that is build up during the solution process. Proof of convergence to a stationary point of the minimized lp-lq functional is provided for both convex and nonconvex problems. Computed examples illustrate that high-quality restorations can be determined with...
متن کاملKrylov subspace iterative methods for nonsymmetric discrete ill-posed problems in image restoration
The BiCG and QMR methods are well-known Krylov subspace iterative methods for the solution of linear systems of equations with a large nonsymmetric, nonsingular matrix. However, little is known of the performance of these methods when they are applied to the computation of approximate solutions of linear systems of equations with a matrix of ill-determined rank. Such linear systems are known as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2012
ISSN: 0377-0427
DOI: 10.1016/j.cam.2011.09.030